Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n
نویسندگان
چکیده
منابع مشابه
pathwidth faster than 2 n ?
Computing the Pathwidth of a graph is the problem of finding a tree decomposition of minimum width, where the decomposition tree is a path. It can be easily computed in O∗(2n) time by using dynamic programming over all vertex subsets. For some time now there has been an open problem if there exists an algorithm computing Pathwidth with running time O∗(cn) for c < 2†. In this paper we show that ...
متن کاملCapacitated Domination Faster Than O(2n)
In this paper we consider the CAPACITATED DOMINATING SET problem — a generalisation of the DOMINATING SET problem where each vertex v is additionally equipped with a number c(v), which is the number of other vertices this vertex can dominate. We provide an algorithm that solves CAPACITATED DOMINATING SET exactly in O(1.89) time and polynomial space. Despite the fact that the CAPACITATED DOMINAT...
متن کاملIrredundant Set Faster Than O(2n)
In this paper we provide algorithms faster than O(2) for two variants of the IRREDUNDANT SET problem. More precisely, we give: – a branch-and-reduce algorithm solving LARGEST IRREDUNDANT SET in O(1.9657) time and polynomial space; the time complexity can be reduced using memoization to O(1.8475) at the cost of using exponential space, – and a simple iterative-DFS algorithm for SMALLEST INCLUSIO...
متن کاملThe size of chordal, interval and threshold subgraphs
Let G* be the class of graphs with n vertices and m edges, and H* a class of graphs. Then there is a number f such that every member of G’ contains a member of H* with at least f edges, and there is a member of G” containing no member of H* with more than f edges. In practice jc may be hard to find and we bound it by finding a lower bound fi (there must be a member of H* with at least fi edges)...
متن کاملComputing Tree-Depth Faster Than 2 n
A connected graph has tree-depth at most k if it is a subgraph of the closure of a rooted tree whose height is at most k. We give an algorithm which for a given n-vertex graph G, in time O(1.9602) computes the tree-depth of G. Our algorithm is based on combinatorial results revealing the structure of minimal rooted trees whose closures contain G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2015
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-015-0054-2